منابع مشابه
Decoding of Matrix-Product Codes
We propose a decoding algorithm for the (u | u+ v)-construction that decodes up to half of the minimum distance of the linear code. We extend this algorithm for a class of matrix-product codes in two different ways. In some cases, one can decode beyond the error correction capability of the code.
متن کاملMatrix-Product Complementary dual Codes
Linear complementary dual codes (LCD) are linear codes satisfying C ∩C = {0}. Under suitable conditions, matrix-product codes that are complementary dual codes are characterized. We construct LCD codes using quasi-orthogonal matrices. Some asymptotic results are derived.
متن کاملFast Product-Matrix Regenerating Codes
Distributed storage systems support failures of individual devices by the use of replication or erasure correcting codes. While erasure correcting codes offer a better storage efficiency than replication for similar fault tolerance, they incur higher CPU consumption, higher network consumption and higher disk I/Os. To address these issues, codes specific to storage systems have been designed. T...
متن کاملIterative Least-Squares Decoding of Analog Product Codes
We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.
متن کاملNew linear codes from matrix-product codes with polynomial units
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Finite Fields and Their Applications
سال: 2020
ISSN: 1071-5797
DOI: 10.1016/j.ffa.2019.101606